Performance Evaluation of Bpn Based Viterbi Decoder for Decoding 2-bit and 3-bit Errors

نویسندگان

  • V. Balamurugan
  • M. Nandhitha
چکیده

In communication, convolution codes are extensively used for reliable data communication at receiver’s end the coded messages are decoded with Viterbi Decoders. However when the channel is noisy decoding becomes computationally complex even with enhanced Viterbi Decoder, hence it necessitates an efficient computationally less complex decoders. In this paper Viterbi Decoders are realized in BPN, performance of the decoder for 2-bit errors and 3-bit errors is studied in terms of accuracy. It is found that Back Propagation Network (BPN) based Viterbi Decoder functions well for both 2-bit and 3-bit errors even after shrinking the hidden layer architecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi Core Performance of a Block Syndrome Decoder for Convolutional Codes

This paper investigates the implementation of forward error correction algorithms on symmetric multiprocessor (SMP) platforms. The focus lies on the Viterbi algorithm (VA) for decoding of convolutional codes. Two aspects will be discussed: How can the VA be implemented on the SMP and how can the decoding complexity be adapted regarding the number of transmission errors? These questions lead to ...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

SOVA Based on a Sectionalized Trellis of Linear Block Codes

The use of block codes is a well known error-control technique for reliable transmission of digital information over noisy communication channels. However, a practically implementable softinput soft-output (SISO) decoding algorithm for block codes is still a challenging problem. This thesis examines a new decoding scheme based on the soft-output Viterbi algorithm (SOVA) applied to a sectionaliz...

متن کامل

Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015